Bayesian Multi-Task Compressive Sensing with Dirichlet Process Priors
نویسندگان
چکیده
Compressive sensing (CS) is an emerging field that, under appropriate conditions, can significantly reduce the number of measurements required for a given signal. Specifically, if the m-dimensional signal u is sparse in an orthonormal basis represented by the m × m matrix Ψ, then one may infer u based on n m projection measurements. If u = Ψθ, where θ are the sparse coefficients in basis Ψ, then the CS measurements are represented by v = Φθ, where v is an n-dimensional vector and Φ is an n × m projection matrix. There are several ways in which the matrix Φ may be constituted, and one typically inverts for the signal u by solving v = Φθ under the constraint that θ is sparse (with this often performed with l1 regularization). In many applications, one is interested in multiple signals {ui}i=1,M that may be measured in multiple CS-type measurements, where here each ui corresponds to a sensing “task”. It is possible to improve the CS performance (e.g., requiring fewer total CS measurements) by exploiting the statistical inter-relationships of the associated {vi}i=1,M CS measurements, jointly inverting for the M underlying signals. In this paper we propose a novel multi-task compressive sensing framework based on a Bayesian formalism, where a sparseness prior is adopted. The key challenge is that not all of the measured {vi}i=1,M are necessarily appropriate for sharing when performing inversion, and one must therefore infer what sharing of data across the M “tasks” is appropriate. Toward this end, a Dirichlet process (DP) prior is employed, which provides a principled means of inferring the appropriate sharing mechanisms (i.e., it infers how best to cluster the M CS measurements, with CS inversion effectively performed separately within each cluster). The posteriors of the sparse signals as well as the sharing mechanism are inferred among all CS tasks. A variational Bayesian (VB) inference algorithm is employed to estimate the full posterior on the model parameters, and an even more efficient simplified VB DP algorithm is also considered. Index Terms Compressive sensing (CS), Multi-task learning, Dirichlet Process Priors, Sparse Bayesian learning, Variational Bayes
منابع مشابه
Learning Task Relatedness via Dirichlet Process Priors for Linear Regression Models
In this paper we present a hierarchical model of linear regression functions in the context of multi–task learning. The parameters of the linear model are coupled by a Dirichlet Process (DP) prior, which implies a clustering of related functions for different tasks. To make approximate Bayesian inference under this model we apply the Bayesian Hierarchical Clustering (BHC) algorithm. The experim...
متن کاملClassification with Incomplete Data Using Dirichlet Process Priors
A non-parametric hierarchical Bayesian framework is developed for designing a classifier, based on a mixture of simple (linear) classifiers. Each simple classifier is termed a local "expert", and the number of experts and their construction are manifested via a Dirichlet process formulation. The simple form of the "experts" allows analytical handling of incomplete data. The model is extended to...
متن کاملMulti-Task Learning for Classification with Dirichlet Process Priors
Multi-task learning (MTL) is considered for logistic-regression classifiers, based on a Dirichlet process (DP) formulation. A symmetric MTL (SMTL) formulation is considered in which classifiers for multiple tasks are learned jointly, with a variational Bayesian (VB) solution. We also consider an asymmetric MTL (AMTL) formulation in which the posterior density function from the SMTL model parame...
متن کاملAnalysis of VB Factorizations for Sparse and Low-Rank Estimation
Variational Bayesian (VB) factorial approximations anchor a wide variety of probabilistic models, where tractable posterior inference is almost never possible. This basic strategy is particularly attractive when estimating structured lowdimensional models of high-dimensional data, exemplified by the search for minimal rank and/or sparse approximations to observed data. To this end, VB models ar...
متن کاملBayesian Compressive Sensing in Radar Systems
Compressive Sensing (CS) is presented in a Bayesian framework for realistic radar cases whose likelihood or priors are usually non-Gaussian. Its sparse-signal processing is modelbased and detection-driven, and also done numerically using Monte-Carlo methods. This approach aims for the stochastic description of sparse solutions, and the flexibility to use any prior information on signals or on d...
متن کامل